Colorful paths for 3-chromatic graphs
نویسندگان
چکیده
منابع مشابه
Colorful paths for 3-chromatic graphs
In this paper, we prove that every 3-chromatic connected graph, except C7, admits a 3-vertex coloring in which every vertex is the beginning of a 3-chromatic path. It is a special case of a conjecture due to S. Akbari, F. Khaghanpoor, and S. Moazzeni, cited in [P.J. Cameron, Research problems from the BCC22, Discrete Math. 311 (2011), 1074–1083], stating that every connected graph G other than ...
متن کاملInduced Colorful Trees and Paths in Large Chromatic Graphs
In a proper vertex coloring of a graph a subgraph is colorful if its vertices are colored with different colors. It is well-known that in every proper coloring of a k-chromatic graph there is a colorful path Pk on k vertices. If the graph is k-chromatic and triangle-free then in any proper coloring there is also a path Pk which is an induced subgraph. N.R. Aravind conjectured that these results...
متن کاملColorful Paths in Vertex Coloring of Graphs
A colorful path in a graph G is a path with χ(G) vertices whose colors are different. A vcolorful path is such a path, starting from v. Let G 6= C7 be a connected graph with maximum degree ∆(G). We show that there exists a (∆(G) + 1)-coloring of G with a v-colorful path for every v ∈ V (G). We also prove that this result is true if one replaces (∆(G) + 1) colors with 2χ(G) colors. If χ(G) = ω(G...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2017.01.016